A decidable subclass of finitary programs
نویسندگان
چکیده
منابع مشابه
A decidable subclass of finitary programs
Answer set programming – the most popular problem solving paradigm based on logic programs – has been recently extended to support uninterpreted function symbols (Syrjänen 2001; Bonatti 2004; Simkus and Eiter 2007; Gebser et al. 2007; Baselice et al. 2009; Calimeri et al. 2008). All of these approaches have some limitation. In this paper we propose a class of programs called FP2 that enjoys a d...
متن کاملFinitary PCF is not decidable
The question of the decidability of the observational ordering of finitary PCF was raised [5] to give mathematical content to the full abstraction problem for PCF [9, 14]. We show that the ordering is in fact undecidable. This result places limits on how explicit a representation of the fully abstract model can be. It also gives a slight strengthening of the author’s earlier result on typed λ-d...
متن کاملA decidable subclass of unbounded security protocols
1 Summary The verification problem for security protocols can be formulated as follows: given an abstract specification of the protocol as a sequence of communications between agents, is it the case that every run generated by possible multi-sessions between agents, with a hypothetical intruder interleaving arbitrarily many actions , satisfies the given security requirements? There are many req...
متن کاملA Decidable Subclass of the Minimal Godel Class with Identity
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...
متن کاملPolynomially Bounded Logic Programs with Function Symbols: A New Decidable
A logic program with function symbols is called finitely ground if there is a finite propositional logic program whose stable models are exactly the same as the stable models of this program. Finite groundability is an important property for logic programs with function symbols because it makes feasible to compute such program’s stable models using traditional ASP solvers. In this paper, we int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2010
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068410000232